Equilibrium Flows and Path Dilation for a Network Forwarding Game 137 Equilibrium Flows and Path Dilation for a Network Forwarding Game George Karakostas1, Anastasios Viglas2

Source URL: www.cas.mcmaster.ca

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Edsger W. Dijkstra
• Networks
• Flow network
• Operations research
• Directed graph
• Price of anarchy
• Shortest path problem
• Routing

AN Lp THEORY OF SPARSE GRAPH CONVERGENCE II: LD CONVERGENCE, QUOTIENTS, AND RIGHT CONVERGENCE CHRISTIAN BORGS, JENNIFER T. CHAYES, HENRY COHN, AND YUFEI ZHAO Abstract. We extend the Lp theory of sparse graph limits, whic

Source URL: yufeizhao.com

Lower and Upper Competitive Bounds for Online Directed Graph ExplorationI Klaus-Tycho Foerstera,1,∗, Roger Wattenhofera a ETH Z¨

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Combinatorial optimization
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• NP-complete problems
• Graph traversal
• Shortest path problem
• Matching
• A* search algorithm
• Planar graph

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexander Barvinok and J.A. Hartigan November 2011 Abstract. We consider the set of all graphs on n labeled vertices with prescribed

Source URL: www.math.lsa.umich.edu

• Mathematics
• Mathematical analysis
• Central limit theorem
• Regular graph
• Matrix
• Entropy
• Number theory
• Graph coloring
• Discriminant of an algebraic number field
• Differential forms on a Riemann surface

Three tutorial lectures on entropy and counting1 David Galvin2 1st Lake Michigan Workshop on Combinatorics and Graph Theory, March 15–These

Source URL: www3.nd.edu

IEEE ROBOTICS AND AUTOMATION LETTERS. PREPRINT VERSION. DECEMBER, Lazy Data Association For Image Sequences Matching Under Substantial Appearance Changes

Source URL: europa2.informatik.uni-freiburg.de

• Mathematics
• Combinatorial optimization
• Graph theory
• Routing algorithms
• Edsger W. Dijkstra
• Search algorithms
• Game artificial intelligence
• A* search algorithm
• Shortest path problem
• Connectivity
• Matching
• Tree

Exploring Watts’ Cascade Boundary Daniel E Whitney Massachusetts Institute of Technology Watts’ “Simple Model of Global Cascades on Random Networks” used percolation theory to derive conditions u

Source URL: necsi.edu

• Graph theory
• Networks
• Network theory
• Physics
• Computing
• Network analysis
• Computer cluster
• Concurrent computing
• Clustering coefficient

CrowdMGR: Interactive Visual Analytics to Interpret Crowdsourced Data Abon Chaudhuri∗ Mahashweta Das†

Source URL: poloclub.gatech.edu

• Crowdsourcing
• Networks
• Network theory
• Graph theory

MIR at LabROSA in 2014 Dan Ellis, Colin Raffel, Zhuo Chen, Dawen Liang, Minshu Zhan, Brian McFee, Nicole Rivilis, Jia-Ming (James) Liu, Cyril Gaudefroy, H`el´ene Papadopoulos, Hilary Mogul, Dylan Kario NEMISIG, January

Source URL: colinraffel.com

• Information science
• Information retrieval
• Algebraic graph theory
• Spectral clustering
• Collaborative filtering
• Ellis
• Collaboration

An Introduction to Algebraic Graph Theory Rob Beezer Department of Mathematics and Computer Science University of Puget Sound

Source URL: buzzard.ups.edu